SWRR: The Link Scheduling Algorithm Based on Weighted Round-Robin

Evaluation of Surplus Round Robin Scheduling Algorithm

In multi-service packet networks the packet scheduling algorithm plays a key role in delivering guaranteed service to different flows. In this article we evaluate surplus round robin (SRR) scheduling algorithm. We apply the Latency-Rate (LR) servers theory in order to obtain bounds on the latency and delay provided by the algorithm. We compare the performance characteristics of SRR with the pop...

Uniform Weighted Round Robin

Quality of service capability of input queued packet switches is investigated. A packet transfer scheduling problem is formulated whereby each input-output pair is scheduled for packet transfers by regularly spaced deadlines, in compliance with a speciied data rate. Suitable applications include ATM networks and satellite switched TDMA systems that support periodic traac with delay guarantees. ...

An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and le...

Uniform weighted round robin scheduling algorithms for input queued switches

| This paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired schedules are uniform in the sense that each connection is serviced at regularly spaced time slots, where the spacing is proportional to the inverse of the guaranteed data rate. Suitable applications include ATM networks as well as satellite switched TDMA systems that prov...

1 Weighted Round Robin Server